A Class of Semi-X Tree-Based Dictionary Machines

This paper proposes a class of semi-X tree-based dictionary machines. This class includes some of the other semi X-tree machines, and demonstrates a possible trade-off between pipeline interval and time taken to execute an instruction (step size). A fan-out restriction found in a previous design is also eliminated. The machines of the proposed design use N storage cells and operate with O(log N ) response time. At one end of this class is a machine that operates with a pipeline interval of two steps. The other end contains a structurally simpler machine that operates with a pipeline interval of O(log N ). The complexity of computation performed by an individual node in these machines is comparable to that of Leiserson’s design.